A High-Speed Codebook Design Algorithm for ECVQ Using Angular Constraint with Search Space Partitioning
نویسندگان
چکیده
In this paper, we propose a fast codebook generation algorithm for entropy-constrained vector quantization (ECVQ). The algorithm uses the angular constraint and employs a suitable hyperplane to partition the codebook and image data in order to reduce the search area and accelerate the search process in the codebook design. This algorithm allows significant acceleration in codebook design process. Experimental results are presented on image block data. These results show that our new algorithm performs better than the previously known methods.
منابع مشابه
Fast codeword search algorithm for ECVQ using hyperplane decision rule
Vector quantization is the process of encoding vector data as an index to a dictionary or codebook of representative vectors. One of the most serious problems for vector quantization is the high computational complexity involved in searching for the closest codeword through the codebook. Entropy-constrained vector quantization (ECVQ) codebook design based on empirical data involves an expensive...
متن کاملOPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملImproving the performance of optimal joint decoding
The optimal joint decoder utilizing NLIVQ (Nonlinear Interpolative Vector Quantization) introduced by Gersho in [1] results in vector quantizers which have reduced encoding complexity at the expense of coding performance loss due to the inferiority of their space-filling property. We show a method of improving a high resolution NLIVQ codebook by partitioning its cells in such a way that the res...
متن کاملOPTIMAL DESIGN OF STEEL MOMENT FRAME STRUCTURES USING THE GA-BASED REDUCED SEARCH SPACE (GA-RSS) TECHNIQUE
This paper proposes a GA-based reduced search space technique (GA-RSS) for the optimal design of steel moment frames. It tries to reduce the computation time by focusing the search around the boundaries of the constraints, using a ranking-based constraint handling to enhance the efficiency of the algorithm. This attempt to reduce the search space is due to the fact that in most optimization pro...
متن کاملVector Quantization: High-Rate Theory and Design Algorithms
The performance of opt imum vector quantizers subject to a conditional entropy constraint is studied in this paper. This new class of vector quantizers was originally suggested by Chou and Lookabaugh. A locally optimal design of this kind of vector quantizer can be accompl ished through a general ization of the well-known entropy-constrained vector quantizer (ECVQ) algorithm. This general izati...
متن کامل